Markovian Process Algebra : Composition and Equivalence
نویسنده
چکیده
Markovian Process Algebra (MPA) is a process algebra enhanced with exponential timing which allows the mapping of speciications on continuous time Markov chains (CTMCs). This paper introduces a compositional approach to compute the generator matrix of the CTMC underlying a MPA speciication which consists of the parallel composition of nite state agents. Furthermore two diierent equivalence relations covering quantitative and qualitative aspects are introduced. These equivalence relations are shown to be congruences according to parallel composition of agents.
منابع مشابه
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that Markovian bisimilarity is consistent with ordinary lumping. The latter is an aggregation for Markov chains that is exact, hence it guarantees the preservation of the performance characteristics across Markovian bisi...
متن کاملOn a Markovian Process AlgebraPeter
Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and quantitative system behaviour. We introduce a a process algebra including exponentially distributed time delays and a systematic approach to compute the underlying labelled transition system and continuous time Markov process. ...
متن کاملExact Fluid Lumpability for Markovian Process Algebra
We study behavioural relations for process algebra with a fluid semantics given in terms of a system of ordinary differential equations (ODEs). We introduce label equivalence, a relation which is shown to induce an exactly lumped fluid model, a potentially smaller ODE system which can be exactly related to the original one. We show that, in general, for two processes that are related in the flu...
متن کاملA Note on the Congruence Proof for Recursion in Markovian Bisimulation Equivalence
This note repairs some inaccuracies in the congruence proof for recursion previously developed for Marko-vian bisimulation equivalence. We provide a revised proof based on standard machinery obtained by smoothly extending Milner's technique based on bisimulation up to. The machinery we introduce for EMPA can be easily adapted in order to obtain accurate proofs for any other Markovian process al...
متن کاملCompositional Markovian Modelling Using A Process Algebra
We introduce a stochastic process algebra, PEPA, as a high-level modelling paradigm for continuous time Markov chains (CTMC). Process algebras are mathematical theories which model concurrent systems by their algebra and provide apparatus for reasoning about the structure and behaviour of the model. Recent extensions of these algebras, associating random variables with actions, make the models ...
متن کامل